منابع مشابه
Large Scale Density-friendly Graph Decomposition via Convex Programming
Algorithms for finding dense regions in an input graph have proved to be effective tools in graph mining and data analysis. Recently, Tatti and Gionis [WWW 2015] presented a novel graph decomposition (known as the locally-dense decomposition) that is similar to the well-known k-core decomposition, with the additional property that its components are arranged in order of their densities. Such a ...
متن کاملtoeplitz graph decomposition
let $n,t_1,...,t_k$ be distinct positive integers. a toeplitz graph $g=(v, e)$ denoted by $t_n$ is a graph, where $v ={1,...,n}$ and $e= {(i,j) : |i-j| in {t_1,...,t_k}}$.in this paper, we present some results on decomposition of toeplitz graphs.
متن کاملUNGRADE: UNsupervised GRAph DEcomposition
This article presents an unsupervised algorithm for word decomposition called UNGRADE (UNsupervised GRAph DEcomposition) to segment any word list of any language. UNGRADE assumes that each word follows the structure prefixes, a stem and suffixes without giving a limit on the number of prefixes and suffixes. The UNGRADE’s algorithm works in three steps and is language independent. Firstly, a pse...
متن کاملExploiting Computation-Friendly Graph Compression Methods
Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In this paper we show that some well-known Web and social graph compression formats are computation-friendly, in the sense that they allow boosting the computation. In particular, we show t...
متن کاملGraph Decomposition and Recursive Closures
Abstract. In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e⋅b) time and O(n⋅b) space, where n is the number of the nodes of the graph, e is the numbers of the edges, and b is the graph’s breadth. It is a better computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery from Data
سال: 2019
ISSN: 1556-4681,1556-472X
DOI: 10.1145/3344210